Amphora Handles, with Greek Stamps, from Tell Sandahannah

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stable nematic droplets with handles.

We stabilize nematic droplets with handles against surface tension-driven instabilities, using a yield-stress material as outer fluid, and study the complex nematic textures and defect structures that result from the competition between topological constraints and the elasticity of the nematic liquid crystal. We uncover a surprisingly persistent twisted configuration of the nematic director ins...

متن کامل

Non-periodic Riemann Examples with Handles

We show the existence of 1-parameter families of non-periodic, complete, embedded minimal surfaces in Euclidean space with infinitely many parallel planar ends. In particular we are able to produce finite genus examples and quasi-periodic examples of infinite genus.

متن کامل

Helicoids with handles and Baker-Akhiezer spinors

For more then 200 years the helicoid was the only known infinite total curvature embedded minimal surface of finite topology. The situation changed in 1993, when Hoffman, Karcher and Wei [9] discovered the genus one helicoid a minimal torus with one end, which has a form of the helicoid at infinity. The genus one helicoid was constructed using the Weierstrass representation. Karcher, Wei and Ho...

متن کامل

Syntax for Binding Documents with Time-Stamps

This document describes an envelope that can be used to bind a file (not necessarily protected by means of cryptographic techniques) with one or more time-stamp tokens obtained for that file, where "time-stamp token" has the meaning defined in RFC 3161 or its successors. Additional types of temporal evidence are also allowed. This is a contribution to the RFC Series, independently of any other ...

متن کامل

Implementing Causal Ordering with Bounded Time stamps

This paper investigates a solution to the problem of causal ordering in message passing distributed systems Causal ordering is the restriction that messages are delivered in a fo fashion with respect to the global causal order between events in the system This is stronger than the condition that each local channel is fo In our algorithm causal ordering is implemented by having each process main...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Palestine Exploration Quarterly

سال: 1901

ISSN: 0031-0328,1743-1301

DOI: 10.1179/peq.1901.33.1.25